Quantitative Analysis for Image-Based Rendering with Depth Information: Part II–2D Occluded Scenes and 3D Scenes

We quantitatively analyze the rendering quality of image-based rendering (IBR) algorithms using per-pixel depth. Assuming the ideal pinhole camera model, we extend the error aggregation framework proposed in a companion paper to 2D occluded scenes and 3D unoccluded scenes. For 2D occluded scenes, we measure the effects of jumps in sample intervals around the discontinuities of the virtual image, resulting in additional terms. For 3D scenes, we derive an error bound for triangulation-based linear interpolation and exploit properties of Poisson Delaunay triangles. We show that the mean absolute errors (MAE) of the virtual images can be bounded based on the characteristics of the scene and the camera configuration. An intriguing finding is that triangulation-based linear interpolation for 3D scenes results in a decay order O(λ−1) of the MAE in smooth regions, where λ is the local density of actual samples, compared to O(λ−2) for 2D scenes.